منابع مشابه
Languages with mismatches
In this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r . The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden wor...
متن کاملLanguages with Mismatches and an Application to Approximate Indexing
In this paper we describe a factorial language, denoted by L(S, k, r), that contains all words that occur in a string S up to k mismatches every r symbols. Then we give some combinatorial properties of a parameter, called repetition index and denoted by R(S, k, r), defined as the smallest integer h ≥ 1 such that all strings of this length occur at most in a unique position of the text S up to k...
متن کاملValency mismatches and the coding of reciprocity in Australian languages
Reciprocals are characterized by a crossover of thematic roles within a single clause. Their peculiar semantics often creates special argument configurations not found in other clause types. While some languages either encode reciprocals by clearly divalent, transitive clauses, or clearly monovalent, intransitive clauses, others adopt a more ambivalent solution. We develop a typology of valency...
متن کاملStreaming Periodicity with Mismatches
We study the problem of finding all k-periods of a length-n string S, presented as a data stream. S is said to have k-period p if its prefix of length n− p differs from its suffix of length n− p in at most k locations. We give a one-pass streaming algorithm that computes the k-periods of a string S using poly(k, logn) bits of space, for k-periods of length at most n 2 . We also present a two-pa...
متن کاملParameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 . . . tn and pattern p = p1p2 . . . pm over respective alphabets Σt and Σp , the injection πi from Σp to Σt maximizing the number of matches between πi(p) and ti ti+1 . . . ti+m−1 (i = 1,2, . . . , n −m + 1). We examine the special case where both strings are run-length encoded, and further ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.06.006